多基准站相对定位算法及先验基线向量偏差影响分析

为提高单基准站短基线相对定位解算的可靠性,研究了多基准站约束的相对定位算法。将基准站间可提前测量的先验基线信息融入观测模型中,给出了多基准站相对定位的函数模型和随机模型,在此基础上推导了模糊度精度因子的解析表达式,揭示了基准站数量的增加对模糊度浮点解精度提升的作用;从理论上分析了基准站间先验基线信息中的偏差对模糊度解算的影响,分析表明,当先验基线各分量偏差的绝对值之和小于5 cm时,模糊度解算几乎不受影响;通过仿真和实测数据进行了验证。试验结果表明,增加基准站数量不仅能有效提升模糊度解算成功率和收敛速度,并且对先验基线信息中的偏差具有较好的抑制作用,当基线各分量偏差均增加到4 cm时,实测数据模糊度解算成功率仍能达到92%以上。研究结论为特殊场景下多基准站间的快速非精确标定提供了理论依据。     

基于多目标参数的液压设备恒定应力加速寿命试验设计

在液压设备恒定应力加速寿命试验中,针对应力的加载方式引起的热冲击和单目标参数带来的分析精度问题,设计了基于多目标参数的液压设备恒定应力加速寿命试验.首先,利用Burr XII型分布建立恒定应力加速寿命试验的数学模型,并以试验产品分位寿命的渐近方差加权和最小为目标,计算出试验最优的低应力水平以及产品在低应力水平和高应力水平上的最佳分配比例;其次,计算出模型参数的置信区间并对模型参数进行敏感性分析;最后,以某液压产品为实例进行分析.结果表明:该试验有助于提高液压产品可靠性分析的精度.     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

基于蝙蝠算法的多目标战备物资调运决策优化

战备物资的调运是部队后勤工作中十分重要的一环,面对复杂多变的战场环境,战备物资调运必须进行科学合理的决策优化。然而现有战备物资调运模型的优化模型较为复杂,如果涉及较多供应点和目标要求则不易实现。针对涉及多个调运点的多目标战备物资调运问题,提出一种新的决策优化模型,利用启发式蝙蝠算法进行优化计算,发挥出蝙蝠算法易于实现、性能优越的特点,较好地解决了涉及较多供应点的多目标战备物资调运决策优化问题,并结合一个仿真算例,证明该方法相对于其他方法更具简易性和有效性。     

Route optimization for multiple searchers

We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于PSO算法的脉冲修正弹控制参数优化*

针对脉冲修正弹自身控制离散不连续特征,开展了脉冲修正弹脉冲控制参数优化设计方法研究。考虑到脉冲成本和精度的双重要求,选择以脉冲发动机工作次数和脱靶量最少为双目标函数,并在风干扰的条件下,提出了以脉冲控制时间间隔为离散脉冲控制参数设计变量建立优化模型,以此发展了一种改进型递减惯性权重粒子群优化脉冲控制参数的方法,提高了修正参数优化收敛速度。仿真结果表明,该算法能快速有效地获得最优解,为在干扰条件下寻找最优的脉冲修正参数和脉冲工作方式提供了一种优化设计思路。     

The solution to an open problem for a caching game

In a caching game introduced by Alpern et al. (Alpern et al., Lecture notes in computer science (2010) 220–233) a Hider who can dig to a total fixed depth normalized to 1 buries a fixed number of objects among n discrete locations. A Searcher who can dig to a total depth of h searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero‐sum game is complicated to analyze even for small values of its parameters, and for the case of 2 hidden objects has been completely solved only when the game is played in up to 3 locations. For some values of h the solution of the game with 2 objects hidden in 4 locations is known, but the solution in the remaining cases was an open question recently highlighted by Fokkink et al. (Fokkink et al., Search theory: A game theoretic perspective (2014) 85–104). Here we solve the remaining cases of the game with 2 objects hidden in 4 locations. We also give some more general results for the game, in particular using a geometrical argument to show that when there are 2 objects hidden in n locations and n→∞, the value of the game is asymptotically equal to h/n for h≥n/2. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 23–31, 2016     

某舰炮托架多目标拓扑优化设计

为避免单目标拓扑优化无法考虑其他因素的缺点,通过基于密度法中的SIMP法,采用折衷规划法定义了多目标拓扑优化。以某舰炮为例,对其托架进行了多目标拓扑优化,得到了同时满足舰炮射角为0°、49°和方向角为0°时刚度最大以及动态低阶振动频率最大要求的舰炮托架的拓扑结构,并根据此优化对托架进行了结构重新改进和有限元的验证,表明了该优化设计方法的可行性。对于舰炮托架结构改进设计具有工程应用价值,对其他一般机械结构问题也提供了一种设计思路。     

具有模糊系数约束的多目标线性规划

研究了一类具有模糊系数约束的多目标线性规划问题.根据各目标函数的梯度方向来量化目标之间的冲突程度,以此提出了一种确定目标权重的新方法,然后基于惩罚函数运用梯度上升算法求问题的有效解.最后给出了一个数值例子.